Implementing intersection bounds in Stata
نویسندگان
چکیده
We present the clrbound, clr2bound, clr3bound, and clrtest commands for estimation and inference on intersection bounds as developed by Chernozhukov et al. (2013). The commands clrbound, clr2bound, and clr3bound provide bound estimates that can be used directly for estimation or to construct asymptotically valid confidence sets. The command clrbound provides bound estimates for one-sided lower or upper intersection bounds on a parameter, while clr2bound and clr3bound provide two-sided bound estimates based on both lower and upper intersection bounds. clr2bound uses Bonferroni’s inequality to construct two-sided bounds, whereas clr3bound inverts a hypothesis test. The former can be used to perform asymptotically valid inference on the identified set or the parameter, while the latter can be used to provide asymptotically valid and generally tighter confidence intervals for the parameter. clrtest performs an intersection bound test of the hypothesis that a collection of lower intersection bounds is no greater than zero. Inversion of this test can be used to construct confidence sets based on conditional moment inequalities as described in Chernozhukov et al. (2013). The commands include parametric, series, and local linear estimation procedures, and can be installed from within Stata by typing “ssc install clrbound”.
منابع مشابه
Some lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملStata Commands for Testing Conditional Moment Inequalities/Equalities
In this paper, we present two commands – cmi test and cmi interval – to implement the testing and inference methods for conditional moment inequalities/equalities models proposed in Andrews and Shi (2013). The command cmi test tests the validity of a finite number of conditional moment equalities and/or inequalities. This test returns the value of the test statistic, the critical values at sign...
متن کاملOn the intersection of additive perfect codes
The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two additive codes C1 and C2 of the same length, is investigated. Lower and upper bounds for the intersection number are computed and, for any value between these bounds, codes which have this given intersection value are constructe...
متن کاملThe Speeds of Families of Intersection Graphs
A fundamental question of graph theory lies in counting the number of graphs which satisfy certain properties. In particular, the structure of intersection graphs of planar curves is unknown, and Schaefer, Sedgwick, and Štefankovič have shown that recognizing such graphs is NP-complete. As such, the number of intersection graphs of planar curves poses an interesting problem. Pach and Tóth have ...
متن کاملAnalysis of validated error bounds of surface-to-surface intersection
In this paper, we address the problem of computing the error bounds of surface to surface intersection and propose a novel procedure to reduce them. We formulate the surface to surface intersection problem as solving a system of ordinary differential equations and using the validated ODE solver we compute the validated a priori enclosures of an intersection curve, in which the existence and the...
متن کامل